On some multipoint methods arising from optimal in the sense of Kung–Traub algorithms
نویسندگان
چکیده
In this paper we will examine self-accelerating in terms of convergence speed and the corresponding index of efficiency in the sense of Ostrowski–Traub of certain standard and most commonly used in practice multipoint iterative methods using several initial approximations for numerical solution of nonlinear equations due to optimal in the sense of the Kung–Traub algorithm of order 4, 8 and 16. Some hypothetical iterative procedures generated by algorithms from order of convergence 32 and 64 are also studied (the receipt and publication of which is a matter of time, having in mind the increased interest in such optimal algorithms). The corresponding model theorems for their convergence speed and efficiency index have been formulated and proved. Keywords-solving nonlinear equations; order of convergence; optimal algorithm; efficiency index
منابع مشابه
A new optimal method of fourth-order convergence for solving nonlinear equations
In this paper, we present a fourth order method for computing simple roots of nonlinear equations by using suitable Taylor and weight function approximation. The method is based on Weerakoon-Fernando method [S. Weerakoon, G.I. Fernando, A variant of Newton's method with third-order convergence, Appl. Math. Lett. 17 (2000) 87-93]. The method is optimal, as it needs three evaluations per iterate,...
متن کاملNew Eighth-Order Derivative-Free Methods for Solving Nonlinear Equations
A new family of eighth-order derivative-freemethods for solving nonlinear equations is presented. It is proved that these methods have the convergence order of eight. These new methods are derivative-free and only use four evaluations of the function per iteration. In fact, we have obtained the optimal order of convergence which supports the Kung and Traub conjecture. Kung and Traub conjectured...
متن کاملAn Efficient Family of Root-Finding Methods with Optimal Eighth-Order Convergence
We derive a family of eighth-order multipoint methods for the solution of nonlinear equations. In terms of computational cost, the family requires evaluations of only three functions and one first derivative per iteration. This implies that the efficiency index of the present methods is 1.682. Kung and Traub 1974 conjectured that multipoint iteration methods without memory based on n evaluation...
متن کاملOn Optimal Multipoint Methods for Solving Nonlinear Equations
A general class of three-point iterative methods for solving nonlinear equations is constructed. Its order of convergence reaches eight with only four function evaluations per iteration, which means that the proposed methods possess as high as possible computational efficiency in the sense of the Kung-Traub hypothesis (1974). Numerical examples are included to demonstrate a spectacular converge...
متن کاملOptimal Sixteenth Order Convergent Method Based on Quasi-Hermite Interpolation for Computing Roots
We have given a four-step, multipoint iterative method without memory for solving nonlinear equations. The method is constructed by using quasi-Hermite interpolation and has order of convergence sixteen. As this method requires four function evaluations and one derivative evaluation at each step, it is optimal in the sense of the Kung and Traub conjecture. The comparisons are given with some ot...
متن کامل